Application of a multi-objective multi traveling salesperson problem with time windows

نویسندگان

چکیده

Abstract The pilgrimage to Mecca, which is called Hajj, the largest annual pedestrian crowd management problem in world. During pilgrims are accommodated camps. For safety reasons, exact times and directions given who moving between holy sites. Despite importance of complying with those schedules, violations can often be conjectured. Directing a small workforce camps monitor pilgrims’ compliance schedule an important matter, will dealt this paper. A type multi-objective multiple traveling salesperson optimization time windows introduced generate tours for employees monitoring flow at campsite. Four objectives being pursued: As many as possible (1), should visited preferably (2), short (3) have waiting visits (4). goal programming, enumeration, Augmecon2 interactive approach developed. topic supported non-supported efficient solutions addressed by determining all enumeration approach. suitability approaches analyzed computational study, while using actual data set Hajj season 2015. application, has been identified most suitable support generation offer project.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

Multi-objective Optimization of Vehicle Routing Problem with Time Windows

Products distribution is a process on which products are moved from sources to customers. According to Toth and Vigo [1], transportation costs typically represent 10-20% of the final price of goods on the market. Over the past 20 years, Vehicle Routing Problem (VRP) was especially solved through the use of meta-heuristics, see Jozefowiez et al. [2], Vidal et al. [3]. Eksioglu et al. [4] made a ...

متن کامل

A Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows

This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...

متن کامل

A multi-criteria vehicle routing problem with soft time windows by simulated annealing

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Public Transport

سال: 2021

ISSN: ['1613-7159', '1866-749X']

DOI: https://doi.org/10.1007/s12469-020-00258-6